Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
نویسندگان
چکیده
منابع مشابه
An Effective Search Framework Combining Meta-Heuristics to Solve the Vehicle Routing Problems with Time Windows
Many delivery problems in real-world applications such as the newspaper delivery and courier services can be formulated as capacitated vehicle routing problems (VRPs) [10], which we want to route a number of vehicles with limited capacity in order to satisfy customer requests with the minimal operational cost. This is usually measured by the number of vehicles used multiplied by the total dista...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملImproving the Initialization and Repair Heuristics to Effectively Solve the Pickup and Delivery Problems with Time Windows
Pickup and delivery problems with time windows (PDPTW) are challenging yet realistic scheduling problems in which each delivery vehicle is assigned to handle different pairs of pickup-anddelivery requests. Our previous work successfully adapted the push forward insertion heuristic (PFIH) for initialization, and proposed a new swap operator to effectively solve PDP-TWs. In this paper, we improve...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملHeuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
In this paper, we consider vehicle routing problems with backhauls and time windows (VRPBTW). Different backhaul variants are studied, namely clustered backhauls (CB), mixed linehauls and backhauls, and variants with simultaneous delivery and pickup and with divisible delivery and pickup. Three dimensional loading constraints are assumed. A two-phase approach following the principle packing fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Review
سال: 2004
ISSN: 0269-2821
DOI: 10.1023/b:aire.0000020864.28300.ed